An Improved Ant Colony Optimization for the Multi-Robot Path Planning with Timeliness

نویسندگان

  • Shuai Zhou
  • Yong Li
  • Xiaoyun Li
چکیده

To achieve efficient search performance for the multi-robot system which carries out the goal search task with consideration of timeliness, a multi-robot collaborative path planning system is designed to guide the robots during the search process. In the system, a planning method based on an Improved Ant Colony Optimization (IACO) algorithm is proposed. In the solution procedure, the path cost and goal timeliness are taken as two optimization goals. Compared to the traditional optimization algorithm, the IACO algorithm has global superiority which brings about better solution. Experiment results show that all robots accomplish the search task safely and efficiently by collaborative work using the proposed approach.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Incorporating Bidirectional Heuristic Search and Improved ACO in Route Planning

A multi-objective multi-node dynamic route planning system for a vehicle is presented in this paper. In this system, a bidirectional heuristic search algorithm is designed to perform path planning between two nodes in a topological map created by OpenStreetMap for urban scenarios. And then an improved multi-objective Ant Colony Optimization (ACO) algorithm considering the timeliness of goal nod...

متن کامل

Optimization Planning based on Improved Ant Colony Algorithm for Robot

As the ant colony algorithm has the defects in robot optimization path planning such as that low convergence cause local optimum, an improved ant colony algorithm is proposed to apply to the planning of path finding for robot. This algorithm uses the search way of exhumation ant to realize the complementation of advantages and accelerate the convergence of algorithm. The experimental result sho...

متن کامل

Mobile Robot Path Planning Based on Multi-parameters Optimization Ant Colony Algorithm

The basic ant colony algorithm for mobile robot path planning has many problems, such as lack of stability,algorithm premature convergence, more difficult to find optimal solution for complex problems and so on. This paper proposes four improvement measures. 1. Apply genetic algorithm to optimization and configuration parameters of the basic ant colony algorithm; 2. Apply max min ant method to ...

متن کامل

Robot Global Path Planning Based on an Improved Ant Colony Algorithm

Aiming at the disadvantages of the basic ant colony algorithm, this paper proposes an improved ant colony algorithm for robot global path planning. First, adjust the pheromone evaporation rate dynamically to enhance the global search ability and convergence speed, and then modify the heuristic function to improve the state transition probabilities in order to find the optimal solution as quickl...

متن کامل

Ant-Q agent System Based Path Optimization Service for a Multi- Objective Mobile Robot and Real World

A multi-objective mobile robot path planning algorithm based on improved Ant-Q agent system algorithm is proposed. The most Driver has Navigation system. It is convenient if him use the Navigation system. But, Navigation systems are not able to determine optimized driving routes considering that each driver has specific driving habits and propensities and many circumstantial changes are present...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014